Behavioral Institutions and Refinements in Generalized Hidden Logics

نویسنده

  • Manuel A. Martins
چکیده

We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract algebraic logic theory of hidden heterogeneous deductive systems (called hid-algebraic logic theory of hidden heterogeneous deductive systems (called hidden k-logics) to the algebraic specification of object oriented programs. This is achieved through the Leibniz congruence relation and its combinatorial properties. We reformulate the notion of hidden k-logic as well as the behavioral logic of a hidden k-logic as institutions. We define refinements as hidden signature morphisms having the extra property of preserving logical consequence. A stricter class of refinements, the ones that preserve behavioral consequence, is studied. We establish sufficient conditions for an ordinary signature morphism to be a behavioral refinement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Behavioral Equivalence Between k-data Structures

or specifications. Sci. Comput. Program., 25, 149–186. [7] Goguen, J. and Malcolm, G. (2000) A hidden agenda. Theor. Comput. Sci., 245, 55–101. [8] Blok, W. and Pigozzi, D. (1992) Algebraic semantics for universal Horn logic without equality. In Romanowska, A. and Smith, J.D.H. (eds.) Universal algebra and quasigroup theory, Lect. Conf., 1989. Res. Expo. Math. Vol. 19. pp. 1–56, Heldermann Verl...

متن کامل

Behavioral Extensions of Institutions

We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of adding support for behavioral equivalence and reasoning to an existing, particular algebraic framework. We call our transformation an “extension” because Ibeh has the same sentences as I and because its entailment relati...

متن کامل

Incompleteness of Behavioral Logics - 7

Incompleteness results for various behavioral logics are investigated. We show that hidden algebra, observational logic, coherent hidden algebra and other current generalizations of hidden algebra do not admit complete deduction systems for equational behavioral satisfaction. The technique used is reduction from a non-recursively enumerable problem to behavioral validity. In fact we show a stro...

متن کامل

Behavioural reasoning for conditional equations

The behavioral equivalence of hidden terms in an equational specification logic is not itself specifiable in general (Buss and Roşu 2000). But much recent work has been done on its partial specification, in particular using coinduction. In this paper we consider the more general notion of conditional behavioral equivalence introduced by Reichel in 1984. We investigate the behavioral proof theor...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2006